| 1. | A simple path is specified by an array of points that are connected by straight lines
简单路径可由通过直线连接的点的数组来指定。 |
| 2. | Every simple path from a node to a descendant leaf contains the same number of black nodes
从节点到后代叶节点的所有简单路径都包含相同的黑节点数 |
| 3. | Your mind follows the simple path , the choice of an animal . but you have courage , at least
你的思想遵循着简单的路线，一个动物的选择。但至少你拥有勇气。 |
| 4. | Your mind follows the simple path . . . the choice of an animal . you see an enemy and you attack it , unthinking
你的头脑就是这么简单。 。 。像个动物一样。看见敌人就不加思索的攻击。 |
| 5. | A universal algorithm for detecting all simple paths between any two nodes in weighted directed acyclic network was presented
提出了一种有向无环网络中任意两节点间所有简单路径的通用搜索算法。 |
| 6. | Your mind follows the simple path . . . the choice of an animal . you see an enemy and you attack it , unthinking
你的思想遵循着简单的路线. . .一个动物的选择。你看见一个敌人，于是你攻击它，不假思索。 |
| 7. | Through what primal paradise in a remote morning of creation ran the simple path by which their hearts visited each other
在远古创世的清晨，通过哪一条太初乐园的单纯的小径，他们的心曾彼此访问过。 |
| 8. | In order to research parts relation network of product family deeply , it is necessary to detect simple paths in parts relation network
为进一步深入研究零部件关系网络，需要搜索零部件关系网络中的简单路径。 |
| 9. | Branching query processing efficiency has also been promoted remarkably . thirdly , when processing simple path queries , this paper proposes methods that could locate the appropriate nodes
第三、对于单路径查询的处理,本文提出的方法可以迅速定位出匹配查询条件的结点,减少了需遍历的节点数量,提高了查询处理效率。 |
| 10. | Third , this dissertation analyzes the complicacy of result size estimation problem for xml structure based query optimization compared to its counterpart in traditionally relational database , and proposes a full - featured result size estimation algorithm for xml query , sxm . for simple path expression query , this dissertation proposes a dynamic synopsis model for xml data based on the concept of f - stable and b - stable , xmap . for complicated path expression query , this dissertation adopts an improved bifocal sampling method for result size estimation
第三，分析了xml结构化查询优化中的查询代价估计问题与传统关系型数据库中的查询代价估计问题的区别，提出了一套完整的xml结构化查询代价估计体系sxm ，包括对简单路径表达进行查询代价估计的动态xml数据统计模型xmap ，对复杂路径表达进行查询代价估计的双焦点例举法，以及对值匹配条件进行查询代价估计的基于小波的多维直方图方法，并能将多种查询表达的查询代价估计结果结合在一起，以给出一个完整的xpath查询的代价估计。 |
